Classical search strategies for test case generation with Constraint Logic Programming
نویسنده
چکیده
Test case generation for concurrent reactive systems on the grounds of symbolic execution basically amounts to searching their state space. As in the case of model checkers, different search strategies (depth-first, breadth-first, best-first, tabu) together with different strategies for storing visited states have a significant impact on the performance of the generation algorithm. We present experimental data for the performance of different search strategies and discuss the results, taking into account counter examples as generated by model checkers.
منابع مشابه
Generation of Test Data Structures Using Constraint Logic Programming
The goal of Bounded-Exhaustive Testing (BET) is the automatic generation of all the test cases satisfying a given invariant, within a given bound. When the input has a complex structure, the development of correct and efficient generators becomes a very challenging task. In this paper we use Constraint Logic Programming (CLP) to systematically develop generators of structurally complex test dat...
متن کاملEfficient generation of test data structures using constraint logic programming and program transformation
The goal of Bounded-Exhaustive Testing (BET) is the automatic generation of all test cases satisfying a given invariant, within a given size bound. When the test cases have a complex structure, the development of correct and efficient generators becomes a very challenging task. In this paper we use Constraint Logic Programming (CLP) to systematically develop generators of structurally complex t...
متن کاملModel Based Testing with Constraint Logic Programming: First Results and Challenges
We summarize our continuing efforts at model based testing of reactive systems on the grounds of Constraint Logic Programming. First experimental results give rise to optimism w.r.t. scalability of our approach, point at necessary improvements, and they help identify future areas of research. Among others, these include search strategies more powerful than backtracking alone, appropriate (graph...
متن کاملStrategies for the Efficient Solution of Hybrid Constraint Logic Programs
Meta-S is a system for defining the cooperation and coordination of constraint solvers to attack hybrid constraint problems. The integration of a logic programming language into this system by considering the language evaluation mechanism resolution as constraint solver yields a CLP language with support for solver cooperation. Using the strategy definition framework of Meta-S we define classic...
متن کاملSolution Strategies for Multi-domain Constraint Logic Programs
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approach easily yields a CLP language with support for solver cooperation. Applying the strategy definition framework of Meta-S we define classical search strategies and more sophisticated ones, that allow an efficient evalu...
متن کامل